Hamed. R Tareghian; Majid Salari
Abstract
Resource constrained project scheduling (RCPS) is a NP-hard optimization problem. One approach to solve this problem is to use priority rule based methods. In this paper we implement eleven most widely used priority rules in parallel and in serial. Using 120 standard test problems each containing from ...
Read More
Resource constrained project scheduling (RCPS) is a NP-hard optimization problem. One approach to solve this problem is to use priority rule based methods. In this paper we implement eleven most widely used priority rules in parallel and in serial. Using 120 standard test problems each containing from 30 to 120 activities, we compared the performance of serial and parallel implementations of priority rules in solving RCPS problems yielding shorter project make spans. The results showed that the parallel implementation of priority rules gives more efficient results. Furthermore, to benefit from the parallel implementation of priority rules, it is only necessary to combine up to three arbitrary priority rules.